216-223 LCE April04
ثبت نشده
چکیده
The human sense of shape and pattern recognition can discern subtle nuances among groups of visual cues that no computer system can reproduce faithfully. Yet when it comes to measuring and evaluating chromatograms, analysts put a great deal of faith into their computerized data-handling systems. During the course of one year, a practising chromatographer might look at 10 000 or more peaks. After some time, an observer develops a finely tuned sense of what constitutes a good or bad peak shape, which peaks will be detected and measured correctly by the data system, and an overall idea of how the observed peaks indicate the instrumentation’s operational health. This sense is formalized in system suitability software that determines an array of chromatogram metrics from test analyses and compares them with goals or minimum performance levels. These programs confirm the suitability of individual chromatography systems to perform specific analytical tasks, often on a daily basis. Such software relies upon accurate designation of target peaks and parameters when set up. Otherwise, it is bound to perform poorly and can fail to find incipient problems. Chromatographers who use datahandling or suitability software (or who make such measurements themselves) should have a thorough understanding of the various metrics that are extracted from a chromatogram. Without this awareness, they relinquish control over the quality of their results. They are using a tool without a working knowledge of its functions and limitations. This month’s “GC Connections” examines the basic measurements of a peak’s size and shape for the purpose of assessing and monitoring chromatographic separations over a period of time. The calculations presented here represent some of the most commonly used metrics of this type. Other related calculations are found throughout various commercially available performance-monitoring systems as well as in individual laboratories’ quality control and assurance (QC–QA) procedures. This article is intended to aid in the general understanding of these calculations, and it does not purport to present computations that are any more or less appropriate than others.
منابع مشابه
Drugs 2007; 67 (2): 215-235
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216 1. Presentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216 2. Prevalence . . . . . . . . . . . . . . . . . . . ....
متن کاملTannins in feedstuffs for simple-stomached animals.
CONTENTS INTRODUCTION . . 210 CHEMISTRY O F T A N N I N S . . . 210 OCCURRENCE O F T A N N I N S . . 211 G E N E R A L . . . 211 T A N N I N S IN CEREALS A N D LEGUME SEEDS . . 213 N A T U R A L FUNCTION O F T A N N I N S . . 215 T A N N I N ANALYSIS . . 215 COLORIMETRIC METHODS . . 215 Vanillin assay . . 215 Folin Denis assay . . 216 Prussian blue assay . . 216 Acid butanol assay . . 216 P R O...
متن کاملCooperative interactions of hemoglobin.
INTRODUCTION ............................................................. 209 FORMULATIONS Ot v THE PROBLEM OF COOPERATIVE LIGAND B1NDING ...... 210 Earl), Models ................................................................... 210 The Adair Scheme .............................................................. 211 The Sequential Models ..........................................................
متن کاملClues from the Brain
CONTENTS INTRODUCTION ..................................................................................................................... 209 NEURAL B SIS OF EMOTION ............................................................................................. 210 Neural Basis of Fear ............................................................................................................ 2...
متن کاملTime-Space Trade-Offs for Longest Common Extensions
We revisit the longest common extension (LCE) problem, that is, preprocess a string T into a compact data structure that supports fast LCE queries. An LCE query takes a pair (i, j) of indices in T and returns the length of the longest common prefix of the suffixes of T starting at positions i and j. We study the time-space trade-offs for the problem, that is, the space used for the data structu...
متن کامل